Pseudo message recognition based on ontology reasoning

ABSTRACT

In some examples, a method for recognizing a pseudo message is described. The method may include receiving a message intended for a recipient having an associated recipient Ontology. The method may also include semantically analyzing content of the message to determine whether the content is inconsistent with any rules in the recipient Ontology. The method may also include, upon a determination that the content is inconsistent with a rule in the recipient Ontology, authenticating the message as a pseudo message.

CROSS-REFERENCE TO RELATED APPLICATIONS

The present application is a Continuation application of U.S.application Ser. No. 13/810,815, filed on Jan. 17, 2013, which is aNational Stage filing under 35 U.S.C. §371 of PCT Application No.PCT/CN2012/070876 filed on Feb. 3, 2012.

BACKGROUND

Unless otherwise indicated herein, the materials described herein arenot prior art to the claims in the present application and are notadmitted to be prior art by inclusion in this section.

Pseudo messages may be used in cloud computing environments forapplications including network performance testing, informationsecurity, and communication synchronization. For example, an engineermay check the health status of a network or server for quality ofservice guarantees by sending a pseudo message through the networkand/or server. When the pseudo message is received, one or moreparameters may be measured that are indicative of the health status. Asanother example, pseudo messages may be randomly mixed with normalmessages to confuse wiretappers for information security. Unfortunately,pseudo messages can confuse the intended recipient and/or be difficultfor the intended recipient to identify.

SUMMARY

Technologies described herein generally relate to the generation andidentification of pseudo messages based on Ontology reasoning.

In some examples, a method for recognizing a pseudo message isdescribed. The method may include receiving a message intended for arecipient having an associated recipient Ontology. The method may alsoinclude semantically analyzing content of the message to determinewhether the content is inconsistent with any rules in the recipientOntology. The method may also include, upon a determination that thecontent is inconsistent with a rule in the recipient Ontology,authenticating the message as a pseudo message.

In some examples, a method for generating a pseudo message recognizableas such by an intended recipient is described. The method may includegenerating an error sentence that is inconsistent with a rule in arecipient Ontology associated with a recipient. The method may alsoinclude selecting a piece of text as background content. The method mayalso include inserting the error sentence into the background content toform the pseudo message.

In some examples, a system for generating and recognizing pseudomessages is described. The system may include a first processor and afirst non-transitory computer-readable medium. The first non-transitorycomputer-readable medium may have computer-executable instructionsstored thereon that are executable by the first processor to performoperations. The operations may include receiving messages intended for arecipient having an associated recipient Ontology. The operations mayalso include semantically analyzing content of each received message todetermine whether the content is inconsistent with any rules in therecipient Ontology. The operations may also include, upon adetermination that the content of a message is inconsistent with a rulein the recipient Ontology, authenticating the message as a pseudomessage.

The foregoing summary is illustrative only and is not intended to be inany way limiting. In addition to the illustrative aspects, embodiments,and features described above, further aspects, embodiments, and featureswill become apparent by reference to the drawings and the followingdetailed description.

BRIEF DESCRIPTION OF THE FIGURES

In the drawings:

FIG. 1 is a block diagram of an example system for implementing pseudomessage recognition based on Ontology reasoning;

FIG. 2 shows an example flow diagram of a method for implementing pseudomessage recognition based on Ontology reasoning;

FIG. 3 illustrates various entities and associated ontologies generatedduring an Ontology generation and/or exchange process;

FIG. 4 illustrates an example of an Ontology;

FIG. 5 is a block diagram of another example system for implementingpseudo message recognition based on Ontology reasoning;

FIG. 6 shows an example flow diagram of a method for generating a pseudomessage recognizable as such by an intended recipient;

FIG. 7 shows an example flow diagram of a method for recognizing apseudo message; and

FIG. 8 is a block diagram illustrating an example computing device thatis arranged for implementing pseudo message recognition based onOntology reasoning, all arranged in accordance with at least someembodiments described herein.

DETAILED DESCRIPTION

In the following detailed description, reference is made to theaccompanying drawings, which form a part hereof. In the drawings,similar symbols typically identify similar components, unless contextdictates otherwise. The illustrative embodiments described in thedetailed description, drawings, and claims are not meant to be limiting.Other embodiments may be utilized, and other changes may be made,without departing from the spirit or scope of the subject matterpresented herein. It will be readily understood that the aspects of thepresent disclosure, as generally described herein, and illustrated inthe Figures, can be arranged, substituted, combined, separated, anddesigned in a wide variety of different configurations, all of which areexplicitly contemplated herein.

Some embodiments described herein implement pseudo message recognitionbased on Ontology reasoning. A sender may generate a sender-selfOntology including information about the sender. The sender may alsogenerate or receive a recipient-other Ontology including informationabout a recipient. Similarly, the recipient may generate arecipient-self Ontology including information about the recipient andmay generate or receive a sender-other Ontology including informationabout the sender.

The sender may generate a pseudo message including content that isinconsistent with a rule in the recipient-other Ontology. In particular,the sender may select a rule from among multiple rules in the recipientOntology. The selected rule may be expressed as a correct sentence. Aword representing a concept of the selected rule within the sentence maybe replaced with an irrelevant word from an available lexicon to form anerror sentence. The sender may also select a piece of text as backgroundcontent and may insert the error sentence into the background content toform the pseudo message. The pseudo message may be sent to the recipientalong with other messages.

The recipient-other Ontology may generally include a subset of therecipient-self Ontology such that any rule in the recipient-otherOntology may also be included as a rule in the recipient-self Ontology.As such, the recipient may receive messages from the sender and use therecipient-self Ontology to identify pseudo messages from amongst thereceived messages. In particular, for each message, the recipient maysemantically analyze content of the message to determine whether thecontent is inconsistent with any rules in the recipient-self Ontology.Upon a determination that the content is inconsistent with a rule in therecipient-self Ontology, the message may be authenticated as a pseudomessage.

FIG. 1 is a block diagram of an example system 100 for implementingpseudo message recognition based on Ontology reasoning, arranged inaccordance with at least some embodiments described herein. The system100 may include a network 102, a sender 104 and a recipient 106.

In general, the network 102 may include one or more wide area networks(WANs) and/or local area networks (LANs) that enable the sender 104 andthe recipient 106 to communicate with each other. In some embodiments,the network 102 includes the Internet, including a global internetworkformed by logical and physical connections between multiple WANs and/orLANs. Alternately or additionally, the network 102 may include one ormore cellular RF networks and/or one or more wired and/or wirelessnetworks such as, but not limited to, 802.xx networks, Bluetooth accesspoints, wireless access points, IP-based networks, or the like. Thenetwork 102 may also include servers that enable one type of network tointerface with another type of network.

Each of the sender 104 and the recipient 106 may include a computingdevice configured to perform one or more operations associated withimplementing pseudo message recognition based on Ontology reasoning,such as described with respect to FIG. 2. For instance, the computingdevice associated with each of the sender 104 and the recipient 106 mayinclude a processor and a memory or other non-transitorycomputer-readable medium. The non-transitory computer-readable mediummay include computer-executable instructions stored thereon that areexecutable by the processor to perform the operations described herein,additional details of which are provided below.

FIG. 2 shows an example flow diagram of a method 200 for implementingpseudo message recognition based on Ontology reasoning, arranged inaccordance with at least some embodiments described herein. The method200 may be performed in whole or in part by one or more of the sender104 and the recipient 106 of FIG. 1. The method 200 includes variousoperations, functions or actions as illustrated by one or more of blocks202, 204, 206, and/or 208. The method 200 of FIG. 2 is described belowin the context of FIG. 1 and may begin at block 202.

In block 202 (Generate or Exchange Private Information Ontologies),private information ontologies are generated and/or exchanged. Forinstance, the sender 104 may generate a sender-self Ontology associatedwith the sender 104 while the recipient 106 may generate arecipient-self Ontology associated with the recipient 106. As usedherein, a private information Ontology may be associated with aparticular entity such as the sender 104 or the recipient 106 if itincludes information about the particular entity. Further, a “self”Ontology may refer to an Ontology including information about the sameentity that has access to the Ontology.

To the extent the sender 104 and recipient 106 may be familiar with eachother and/or may know information about each other, each may alsogenerate a private information Ontology associated with the other basedon their respective knowledge of the other. For instance, the sender 104may generate a recipient-other Ontology associated with the recipient106 based on the sender's 104 knowledge of the recipient 106, while therecipient 106 may generate a sender-other Ontology associated with thesender 104 based on the recipient's 106 knowledge of the sender 104. An“other” Ontology may refer to an Ontology including information about adifferent entity than has access to the Ontology.

In general, the recipient-other Ontology generated by the sender 104 maybe a subset of the recipient-self Ontology generated by the recipient106 as the recipient 106 may know more information about itself than thesender 104. Similarly, the sender-other Ontology generated by therecipient 106 may be a subset of the sender-self Ontology generated bythe sender 104 as the sender 104 may know more information about itselfthan the recipient 106. The recipient-self Ontology and therecipient-other Ontology may be collectively referred to hereinafter asthe recipient Ontology, while the sender-self Ontology and thesend-other Ontology may be collectively referred to hereinafter as thesender Ontology.

To the extent the sender 104 and recipient 106 may not be familiar witheach and/or in other circumstances, the sender 104 may send all or asubset of the sender-self Ontology to the recipient 106 as thesender-other Ontology. Analogously, the recipient 106 may send all or asubset of the recipient-self Ontology to the sender 104 as therecipient-other Ontology. Block 202 may be followed by block 204. Inthese and other embodiments, the sender-other Ontology sent to therecipient 106 and/or the recipient-other Ontology sent to the sender 104may be encrypted. Block 202 may be followed by block 204.

In block 204 (Generate and Send a Pseudo Message), a pseudo message maybe generated and sent from the sender 104 to the recipient 106. Ingeneral, a pseudo message may include content that is inconsistent withany rule in the recipient Ontology. In particular, in these and otherembodiments, the sender 104 may generate the pseudo message includingcontent that is inconsistent with any rule in the recipient Ontologybased on the recipient-other Ontology to which the sender 104 hasaccess. Block 204 may be followed by block 206

In block 206 (Perform Recognition Processing), recognition processingmay be performed by the recipient 106 to identify the pseudo message assuch. In particular, in these and other embodiments, the recipient 106may semantically analyze messages received from the sender 104 toidentify and compare content of the messages against rules in therecipient-self Ontology to which the recipient 106 has access. Upondetermining that a given message includes content that is inconsistentwith any rule in the recipient Ontology, the recipient 106 mayauthenticate the message as a pseudo message. Block 206 may be followedby block 208.

In block 208 (Submit Pseudo Message to Suited Module), the authenticatedpseudo message may be submitted to a suited module for furtherprocessing. For instance, if the pseudo message is sent for networkperformance testing, the pseudo message may be submitted to a networkperformance testing module to measure one or more channel parameters ofa channel over which the pseudo messages are transmitted from the sender104 to the recipient 106.

One skilled in the art will appreciate that, for this and otherprocesses and methods disclosed herein, the functions performed in theprocesses and methods may be implemented in differing order.Furthermore, the outlined steps and operations are only provided asexamples, and some of the steps and operations may be optional, combinedinto fewer steps and operations, or expanded into additional steps andoperations without detracting from the essence of the disclosedembodiments.

For instance, pseudo messages may be generated and sent by the sender104 to the recipient 106 for recognition as such by providing both thesender 104 and the recipient 106 with access to the recipient Ontology.In these and other embodiments, generation and/or exchange of the senderOntology, whether the sender-self Ontology or the sender-other Ontology,can be omitted from the method 200 of FIG. 2. Alternately oradditionally, by providing access to the sender Ontology to both thesender 104 and the recipient 106, pseudo messages may be generated andsent by the recipient 106 to the sender 104 for recognition as such.Accordingly, while the sender 104 has been described above as generatingand sending pseudo messages and the recipient has been described aboveas receiving and recognizing pseudo messages as such, their roles mayinstead be reversed in some embodiments.

In some embodiments, the sender 104 may use pseudo messages to perform anetwork performance test for quality of service guarantees of a cloudservice. In these and other embodiments, the sender 104 may include anengineer who desires to test, for instance, the all-phase performance ofthe cloud service. To do so, the engineer, or sender 104, may generate apseudo message and feed it into the service. When the pseudo message isreceived and recognized as such at the recipient 106, the engineer mayrecord any desired data, such as time delay, error probability, and/orsatisfy degree for one or more of the phases.

FIG. 3 illustrates various entities and associated ontologies generatedduring an Ontology generation and/or exchange process 300, arranged inaccordance with at least some embodiments described herein. The process300 may correspond to, for example, operations associated with block 202of FIG. 2.

The process 300 may include, at 302, one or both of an entity A 304 andan entity B 306 generating a corresponding “self” Ontology 308 and 310,respectively. The “self” ontologies 308 and 310 are respectivelyidentified in FIG. 3 as O_(self) ^(A) and O_(self) ^(B).

The process 300 may additionally include, at 312, one or both of theentity A 304 and the entity B 306 generating or receiving acorresponding “other” Ontology 314 and 316, respectively. The “other”ontologies 314 and 316 are respectively identified in FIG. 3 asO_(other) ^(B) and O_(other) ^(A). The “self” ontologies 308 and 310and/or “other” ontologies 314 and 316 may be generated consistent with apredetermined Ontology structure. In some embodiments, the predeterminedOntology structure may include concept nodes and relationship edges, asdescribed in greater detail below with respect to FIG. 4.

When the entity A 304 generates the “other” Ontology 314 associated withthe entity B 306 and/or the entity B 306 generates the “other” Ontology316 associated with the entity A 304, the “other” ontologies 314 and/or316 may each include a subset of a corresponding one of the “self”ontologies 310 and/or 308. In particular, the entity B 306 may generallyknow more about itself than the entity A 304 and the entity A 304 maygenerally know more about itself than the entity B 306.

Alternately or additionally, the entity B 306 may send a copy of all ora portion of its “self” Ontology 310 to the entity A 304 as the “other”Ontology 314, and/or the entity A 304 may send a copy of all or aportion of its “self” Ontology 308 to the entity B 306 as the “other”Ontology 316. In these and other embodiments, the “other” Ontology 314may be encrypted when sent by the entity B 306 to the entity A 304,and/or the “other” Ontology 316 may be encrypted when sent by the entityA 304 to the entity B 306.

Accordingly, both the entity A 304 and the entity B 306 may have accessto an Ontology associated with the entity B 306, namely, the “other”Ontology 314 and the “self” Ontology 310. As such, the entity A 304 maygenerate pseudo messages including content that is inconsistent with arule in the Ontology associated with the entity B 306. In particular,according to the monotonic property of Ontology reasoning, the reasoningof the “other” Ontology 314 may be consistent with the reasoning of the“self” Ontology 310 such that if content is inconsistent with a rule inthe “other” Ontology 314, it may also be inconsistent with a rule in the“self” Ontology 310. Thus, the entity A 304 may send a pseudo messageincluding content that is inconsistent with a rule in the Ontologyassociated with the entity B 306 to the entity B 306, where the pseudomessage may be recognized as such by the entity B 306 by reference tothe “self” Ontology 310. In the foregoing example, the entity A 304 andthe entity B 306 may respectively correspond to the sender 104 and therecipient 106 of FIG. 1.

Alternately or additionally, both the entity B 306 and the entity A 304may have access to an Ontology associated with the entity A 304, namely,the “other” Ontology 316 and the “self” Ontology 308. As such, theentity B 306 may generate pseudo messages including content that isinconsistent with a rule in the Ontology associated with the entity A304. In particular, according to the monotonic property of Ontologyreasoning, the reasoning of the “other” Ontology 316 may be consistentwith the reasoning of the “self” Ontology 308 such that if content isinconsistent with a rule in the “other” Ontology 316, it may also beinconsistent with a rule in the “self” Ontology 308. Thus, the entity B306 may send a pseudo message including content that is inconsistentwith a rule in the Ontology associated with the entity A 304 to theentity A 304, where the pseudo message may be recognized as such by theentity A 304 by reference to the “self” Ontology 308. In the foregoingexample, the entity B 306 and the entity A 304 may respectivelycorrespond to the sender 104 and the recipient 106 of FIG. 1.

FIG. 4 illustrates an example of an Ontology 400, arranged in accordancewith at least some embodiments described herein. The Ontology 400 maycorrespond to the “self” ontologies 308, 310 and/or the “other”ontologies 314, 316 of FIG. 3, for instance. The Ontology 400 isrepresented in FIG. 4 in a graphical form, e.g., as a hierarchical treestructure. However, the Ontology 400 can alternately or additionally berepresented using statements, as a set of classes and properties, or thelike.

The Ontology 400 represents a predetermined Ontology structure generallyincluding multiple concept nodes and multiple relationship edges. Inparticular, as illustrated in FIG. 4, the Ontology 400 includes conceptnodes 401-412. Each of the concept nodes 401-412 represents a particularconcept associated with entity A in the illustrated embodiment. Theparticular concepts are identified generically in FIG. 4, such as“Entity A” for the concept node 401, “Son's Name” for the concept node403, “Nickname” for the concept node 404, “Vocation” for the conceptnode 407, and so on. In practice, however, the particular concepts maybe identified in the Ontology 400 with more specificity, examples ofwhich may include, but are not limited to, “Jack” for the concept node401, “William” for the concept node 403, “Bill” for the concept node404, “Fireman” for the concept node 407, and so on.

The Ontology 400 additionally includes relationship edges 413, only someof which are labeled in FIG. 4 for clarity. The relationship edges 413include relationship edges 413A, 413B. Each relationship edge 413 may beconnected between a corresponding pair of concept nodes 401-412 and maydefine a relationship between the corresponding pair of concept nodes401-412.

For example, in the illustrated embodiment, the relationship edge 413Amay be connected between the concept node 401 and the concept node 403.Further, the relationship edge 413A may define a particular relationshipbetween the concept node 401 and the concept node 403, such as “Son'sName” is the son of “Entity A,” or as a more specific example, “William”is the son of “Jack.” As another example, the relationship edge 413B isconnected between the concept node 403 and the concept node 404. Therelationship edge 413B may define a particular relationship between theconcept node 403 and the concept node 404, such as “Nickname” is “Son'sName” nickname, or as a more specific example, “Bill” is “William's”nickname.

The concept node 401 may be referred to as a “root” node, while theconcept nodes 402-412 may be referred to as “offspring” nodes. Each ofthe relationship edges 413 may have a security level secu determinedwith respect to distance, in terms of intervening concept nodes, betweenthe relationship edge 413 and the root node 401. In particular thesecurity level secu may be determined according to secu=α dis, where ais a weighting constant such that 1/dis_(MAX)>α>0, dis is a number ofconcept nodes from the root node 401 to the farthest concept node402-412 connected to the relationship edge 413, and dis_(MAX) is themaximum dis in the Ontology 400. For example, dis for the relationshipedge 413A may be 1, while dis for the relationship edge 413B may be 2.As such, the security level secu for each of the relationship edges 413Aand 413B may be a or 2 a, respectively. More generally, the securitylevel secu for a given relationship edge 413 may be greater the furtherthe given relationship edge 413 is from the root node 401.

The relationships defined by relationship edges 413 represent rules ofthe Ontology 400. As already described herein, a sender can generate apseudo message by first generating an error sentence that isinconsistent with a rule in a recipient Ontology. The error sentence maybe generated by selecting any rule, represented by any of therelationship edges 413, and expressing the rule as a correct sentence,then modifying it. For example, a word in the correct sentencerepresenting a concept of the rule may be replaced with an irrelevantword from an available lexicon to form the error sentence. For instance,a rule represented by the relationship edge 413A may be selected andcorrectly expressed as “William is the son of Jack” in an exampleembodiment. Each of the concept nodes 401, 403 associated with the rulerepresented by the relationship edge 413A may correspond to a concept ofthe rule. In the present example, “William” may represent a concept ofthe rule. As such, a corresponding error sentence may then be formed byreplacing “William” with an irrelevant word from an available lexiconsuch that the error sentence is inconsistent with the rule in theOntology 400. For instance, by way of example only, and assuming “Jack”does not additionally have a son named “James,” “William” may bereplaced by “James” to form the error sentence “James is the son ofJack.”

Alternately or additionally, the Ontology 400 may be implemented as adata structure stored in a non-transitory computer-readable mediumand/or transmitted over a communication channel as an electrical orwireless signal. In these and other embodiments, one or more datastructures may be maintained and accessible at different levels of theOntology 400, such as, but not limited to, one or more parent datastructures, one or more child data structures, one or more internal datastructures, and/or one or more edge structures. The data structures thatimplement the concept nodes, relationship edges, and/or other componentsof the Ontology 400 may include any suitable form of data structureincluding, but not limited to, data trees, and/or data tables.

In general, as used herein, the term “data structure” may refer to aparticular method of mechanism of storing and organizing data andknowledge in a computing environment so that it can be used efficiently.

In these and other embodiments, and with combined reference to FIGS. 1and 4, a non-transitory computer-readable medium of a computing deviceassociated with the sender 104 may include stored thereon thesender-self Ontology implemented as a first data structure and therecipient-other Ontology implemented as a second data structure.Alternately or additionally, a non-transitory computer-readable mediumof a computing device associated with the recipient 106 may includestored thereon the recipient-self Ontology implemented as a third datastructure and the sender-other Ontology implemented as a fourth datastructure. Here, the terms “first,” “second,” “third,” and “fourth” donot designate any sort of order but rather are simply used todistinguish between the various data structures.

FIG. 5 is a block diagram of another example system 500 for implementingpseudo message recognition based on Ontology reasoning, arranged inaccordance with at least some embodiments described herein. The system500 includes a sender 502, a recipient 504 and a wiretapper 506. Thesender 502 and the recipient 504 may respectively correspond to thesender 104 and the recipient 106 of FIG. 1.

In the illustrated embodiment, the sender 502 may include a pseudomessage generator 508 and a message mixer 510. The pseudo messagegenerator 508 may be configured to generate pseudo messages as describedherein. For example, the pseudo message generator 508 may be configuredto generate an error sentence that is inconsistent with a rule in arecipient Ontology associated with the recipient 504, and to insert theerror sentence into background content that might otherwise be sent in anormal message such that the pseudo message, including the errorsentence and the background content, otherwise appears to be a normalmessage.

The message mixer 510 may be configured to mix the pseudo messages withnormal messages that are communicated to the recipient 504 via acommunication channel. Because the error sentence is inserted intobackground content that might otherwise be sent as a normal message, thepseudo message can be hidden from wiretappers 506 or other eavesdropperslistening in on the communication channel between the sender 502 and therecipient 504. According to some embodiments described herein,wiretappers 506 or other unauthorized eavesdroppers of the pseudomessage may be unable to identify the pseudo message as such withoutaccess to the recipient Ontology or at least to the rule in therecipient Ontology.

The recipient 504 may include a message identifier 512. The messageidentifier 512 may be configured to perform recognition processing asdescribed with respect to FIG. 2 and in additional detail below to sortthe pseudo messages from the normal messages. The message identifier 512may discard pseudo messages or forward pseudo messages to a suitedmodule for further processing, and/or may forward normal messages for,e.g., reconstructing a website or other content made up by the normalmessages for display to a user 514.

In some systems, pseudo messages may include relatively outstandingstatistic characteristics insofar as the number of rules in an Ontologyis finite, such that the number of available error sentences may also befinite and therefore relatively easy to compromise by wiretappers 506 orother eavesdroppers if pseudo messages are made up only of errorsentences. According to some embodiments described herein, however,statistic characteristics of a pseudo message may be obfuscated fromwiretappers 506 or other eavesdroppers by inserting the error sentenceinto background content configured to obfuscate the statisticcharacteristics of the pseudo message.

Alternately or additionally, pseudo messages may confuse the wiretapper506. Specifically, by mixing the pseudo messages containing falseinformation, such as error sentences, with normal messages containingtrue information, the true information may be obfuscated from thewiretapper 506 or other eavesdroppers.

Alternately or additionally, pseudo messages may be automaticallygenerated and sent from a computing device including the pseudo messagegenerator 508 and the message mixer 510 and that is associated with thesender 502. The pseudo messages may be automatically generated and sentto the recipient 504 even when the sender 502 is not actively operatingthe computing device. Whereas the otherwise absence of communication mayindicate to the wiretapper 506 or other eavesdropper that the sender 502is inactive, the automatic generation and transmission of pseudomessages may obfuscate an inactive status of the sender 502 from thewiretapper 506 or other eavesdropper.

FIG. 6 shows an example flow diagram of a method 600 for generating apseudo message recognizable as such by an intended recipient, arrangedin accordance with at least some embodiments described herein. Themethod 600 may be performed in whole or in part by a sender, such as thesender 104 or 502 of FIG. 1 or 5, which sender may correspond to, e.g.,the entity A 304 or the entity B 306 of FIG. 3. The method 600 includesvarious operations, functions or actions as illustrated by one or moreof blocks 602, 604 and/or 606. The method 600 may begin at block 602.

In block 602 (Generate an Error Sentence that Is Inconsistent with aRule in a Recipient Ontology Associated with a Recipient), an errorsentence may be generated that is inconsistent with a rule in arecipient Ontology associated with a recipient. Optionally, the errorsentence may be expressed in eXtensible Markup Language (XML) format. Insome embodiments, generating an error sentence that is inconsistent witha rule in the recipient Ontology may include selecting the rule fromamong multiple rules of the recipient Ontology and expressing the ruleas a correct sentence. A word representing a concept of the rule in thecorrect sentence may be replaced with an irrelevant word from anavailable lexicon to form the error sentence.

As described above with respect to FIG. 4, for example, a rule correctlyexpressed as “William is the son of Jack” may have “William” replaced by“James” to form the error sentence “James is the son of Jack.” Asanother example, a rule correctly expressed as “Bill is William'snickname” may have “Bill” replaced by “Willy” to form the error sentence“Willy is William's nickname.” As still another example, a rulecorrectly expressed as “Jack is a fireman” may have “fireman” replacedby “policeman” to form the error sentence “Jack is a policeman.” Theforegoing are provided by way of example only and should not beconstrued as limiting. Returning to FIG. 6, block 602 may be followed byblock 604.

In block 604 (Select a Piece of Text as Background Content), a piece oftext may be selected as background content into which the error sentencemay be inserted. The background content including the piece of text maybe extracted from, e.g., any available web pages or other informationresource. Block 604 may be followed by block 606.

In block 606 (Insert the Error Sentence into the Background Content toForm the Pseudo Message), the error sentence may be inserted into thebackground content to form the pseudo message.

In these and other embodiments, selecting a piece of text as backgroundcontent may include selecting a word set that has at least apredetermined similarity to a normal word set that may be sent to therecipient in another message not including a pseudo message. As such,the pseudo message may be indistinguishable as such from the othermessage without access to the rule in the recipient Ontology.

In some embodiments, the selected word set may be in an eXtensibleMarkup Language (XML) format and may be denoted as X_(c). X_(c) mayinclude any candidate word set denoted X_(candidate) such that:

$S = {{{SIM}\left( {M_{k},X_{candidate}} \right)} = {{\frac{1}{m} \cdot {\sum\limits_{j = 0}^{m}{\max\limits_{i - 0}^{n}\left\lbrack {{sim}\left( {w_{j}^{X},w_{j}^{M}} \right)} \right\rbrack}}} > {T.}}}$

According to the foregoing formula, S=SIM(M_(k), X_(candidate)) mayinclude a calculated similarity between a normal word set M_(k) and thecandidate word set X_(candidate). The normal word set M_(k) may belongto a message which comes from a corpus, including a set of daily normalmessages of a sender, such as the sender 104 or 502 of FIG. 1 or 5,which sender may correspond to, e.g., the entity A 304 or the entity B306 of FIG. 3. The candidate word set X_(candidate) may belong to asection or the whole of an XML document which comes from any availableinformation source. T may be the predetermined similarity. The normalword set M_(k) may include multiple words expressed as M_(k)={w₀ ^(M),w₁ ^(M), . . . , w_(i) ^(M), . . . , w_(n) ^(M)}, where w_(i) ^(M)denotes an arbitrary word in M_(k) and i is an integer from 0 to n. Thecandidate word set X may also include multiple words expressed candidateas X_(candidate)={w₀ ^(X), w₁ ^(X), . . . w_(j) ^(X), . . . , w_(m)^(X)}, where w_(j) ^(X) denotes an arbitrary word in X_(candidate) and jis an integer from 0 to m.

In these and other embodiments, sim(w_(i), w_(j)) may be calculated asfollows:

${{sim}\left( {w_{i},w_{j}} \right)} = \left\{ {\begin{matrix}{1,} & {w_{i} = w_{j}} \\{{sim}_{wordnet},} & {w_{i} \neq w_{j}}\end{matrix},} \right.$

where sim_(wordnet) is a similarity calculated according to WordNet.With respect to the similarity calculated according to WordNet, thefollowing reference is herein incorporated by reference in its entirety:Leacock C, Chodorow M, “Combining local context and WordNet similarityfor word sense identification,” //FELLBAUMC, WordNet: An electroniclexical data-base, MIT Press. 1998:265-283.

The operations 602, 604, and/or 606 may be performed in any suitableorder or no order at all. For instance, the error sentence may begenerated before or after selecting a piece of text as backgroundcontent. Alternately, the error sentence may be generated concurrentlywith selecting a piece of text as background content.

Although not shown, the method 600 may additionally include sending thepseudo message, or multiple pseudo messages generated as described withrespect to FIG. 6, to the recipient. In some embodiments, pseudomessages may be automatically generated and sent from a correspondingsender computing device when a corresponding sender is not activelyoperating the sender computing device to obfuscate an inactive status ofthe sender from eavesdroppers.

Alternately or additionally, the pseudo message may be used to identifya security class of a sender of the pseudo message or a priority of thepseudo message, hereinafter both referred to as PRI. The PRI maycorrespond to the security level secu of the relationship edge fromwhich the error sentence may be derived. Accordingly, when an errorsentence is generated from a rule represented by a relationship definedby a relationship edge in the recipient Ontology, the rule may beselected to have a security level secu corresponding to a desired PRI.When the pseudo message is subsequently received by the recipient, therecipient may then determine the security level secu to determine thePRI. In some embodiments, the recipient may preferentially processpseudo messages according to PRI. Alternately or additionally, therecipient may identify the security class to authenticate the senderinsofar as a high PRI may indicate that the sender has relatively moreintimate knowledge of the recipient than would be the case for a lowPRI.

In some embodiments, the method 600 may additionally include generatingat least a portion of the recipient Ontology based on the knowledge of asender of the pseudo message. For instance, as described with respect toFIG. 1, the recipient-other Ontology may be generated by the sender 104,or as described with respect to FIG. 3, the “other” Ontology 314 (or the“other” Ontology 316) may be generated by the entity A 304 (or theentity B 306).

Alternately, the method 600 may additionally include receiving at leasta portion of the recipient Ontology from the recipient. For instance, asalternately described with respect to FIG. 1, the recipient-otherOntology may be received by the sender 104 from the recipient 106, or asalternately described with respect to FIG. 3, the “other” Ontology 314(or the “other” Ontology 316) may be received by the entity A 304 (orthe entity B 306) from the entity B 306 (or from the entity A 304).

Accordingly, both the sender and the recipient may have access to atleast a portion of the recipient Ontology such that the sender maygenerate and send pseudo messages recognizable as such to the recipientas already described with respect to FIG. 6. Alternately oradditionally, both the sender and the recipient may have access to atleast a portion of the sender Ontology such that the method 600 mayalternately or additionally include the recipient generating and sendingpseudo messages recognizable as such by the sender by including in eachpseudo message an error sentence inconsistent with a corresponding rulein the sender Ontology.

Some embodiments disclosed herein include a non-transitorycomputer-readable medium having computer-executable instructions storedthereon that are executable by a computing device to perform the method600 of FIG. 6 and/or variations thereof. For example, a sender computingdevice may include a processor and the non-transitory computer-readablemedium where the processor is configured to execute thecomputer-executable instructions stored on the non-transitorycomputer-readable medium to cause the sender computing device to performany one or more of the operations 602, 604, and/or 606 of the method 600and/or variations thereof.

FIG. 7 shows an example flow diagram of a method 700 for recognizing apseudo message, arranged in accordance with at least some embodimentsdescribed herein. The method 700 may be performed in whole or in part bya recipient, such as the recipient 106 or 504 of FIG. 1 or 5, whichrecipient may correspond to, e.g., the entity A 304 or the entity B 306of FIG. 3. The method 700 includes various operations, functions oractions as illustrated by one or more of blocks 702, 704 and/or 706. Themethod 700 may begin at block 702.

In block 702 (Receive a Message Intended for a Recipient Having anAssociated Recipient Ontology), a message intended for a recipienthaving an associated recipient Ontology may be received. In someembodiments, the message may be previously generated by a sender asdescribed with respect to the method 600 of FIG. 6 above. Block 702 maybe followed by block 704.

In block 704 (Semantically Analyze Content of the Message to DetermineWhether the Content is Inconsistent with any Rules in the RecipientOntology), content of the message may be semantically analyzed todetermine whether the content is inconsistent with any rules in therecipient Ontology. In some embodiments, the content of the message mayinclude text. In these and other embodiments, semantically analyzingcontent of the message to determine whether the content is inconsistentwith a rule in the recipient Ontology may include parsing the text intoone or more sentences.

For each of the one or more sentences, the sentence may be compared withrules in the recipient Ontology. If the sentence is false in view of anyof the rules in the recipient Ontology, it may be determined that thecontent is inconsistent with a rule in the recipient Ontology. Forexample, if one of the sentences includes “James is the son of Jack” andthe recipient Ontology includes a rule that “William is the son ofJack”, then the sentence “James is the son of Jack” is false in view ofthe rule and it may be determined that the content of the message isinconsistent with at least one of the rules of the recipient Ontology.Alternately, if the sentence is not false in view of the rules in therecipient Ontology, it may be determined that the content is notinconsistent with a rule in the recipient Ontology.

In some embodiments, each sentence may be compared in turn, or inparallel, with rules in the recipient Ontology until all of thesentences have been analyzed and determined to be not false, or until atleast one false sentence is identified. If all of the sentences aredetermined to be not false, then the message from which the sentenceswere parsed may be identified as a normal message and may be processedas already described above. Alternately, if at least one of thesentences is determined to be false, the message from which thesentences were parsed may be identified as a pseudo message.

More generally, and returning to FIG. 7, block 704 may be followed byblock 706. In block 706 (Upon a Determination that the Content IsInconsistent with a Rule in the Recipient Ontology, Authenticate theMessage as a Pseudo Message), upon a determination that the content isinconsistent with a rule in the recipient Ontology, the message may beauthenticated as a pseudo message.

Although not illustrated in FIG. 7, in some embodiments the method 700may further include measuring one or more channel parameters of achannel over which the message was received based on the pseudo message.In some embodiments, when a recipient identifies a pseudo message assuch, the recipient may send the measurements to the sender. Alternatelyor additionally, the sender may calculate or derive additional channelparameters from the measurements sent by the recipient to the sender.The one or more channel parameters may include, but are not limited to,error probability, satisfy degree or quality of service (QoS),throughput, delay variation, and jitter.

Alternately or additionally, the method 700 may further includedetermining a security level of the pseudo message based on a distancefrom a relationship edge associated with the rule in the recipientOntology to a root node in the recipient Ontology. In some embodiments,the security level may be determined according to secu=a dis, where a isa weighting constant such that 1/dis_(MAX)>α>0, dis is a number ofconcept nodes from the root node to a concept node connected to therelationship edge that is farthest from the root node and dis_(MAX) isthe maximum dis in the recipient Ontology.

In some embodiments, a PRI of the pseudo message may be determined bythe security level secu, where the higher the security level secu, thehigher the PRI of the pseudo message. PRI can be used to authenticate anidentity of the sender of the pseudo message, as a high PRI may indicatethat the sender has relatively more intimate knowledge of the recipientthan would be the case for a low PRI. Alternately or additionally, therecipient may preferentially process pseudo messages based on PRI. Forinstance, when multiple pseudo messages are received at about the sametime, those with a higher PRI may be processed before those with a lowerPRI.

In some embodiments, the method 700 may further include, prior toreceiving the message, sending at least a portion of the recipientOntology to a sender from which the message is received.

Some embodiments disclosed herein include a non-transitorycomputer-readable medium having computer-executable instructions storedthereon that are executable by a computing device to perform the method700 of FIG. 7 and/or variations thereof. For example, a recipientcomputing device may include a processor and the non-transitorycomputer-readable medium where the processor is configured to executethe computer-executable instructions stored on the non-transitorycomputer-readable medium to cause the recipient computing device toperform any one or more of the operations 702, 704, and/or 706 of themethod 700 and/or variations thereof.

FIG. 8 is a block diagram illustrating an example computing device 800that is arranged for implementing pseudo message recognition based onOntology reasoning, arranged in accordance with at least someembodiments described herein. The computing device 800 may correspondto, for instance, any one of the sender 104 or the recipient 106 of FIG.1, or the entity A 304 or the entity B 306 of FIG. 3, or the sender 502or the recipient 504 of FIG. 5. In a very basic configuration 802,computing device 800 typically includes one or more processors 804 and asystem memory 806. A memory bus 808 may be used for communicatingbetween processor 804 and system memory 806.

Depending on the desired configuration, processor 804 may be of any typeincluding but not limited to a microprocessor (μP), a microcontroller(μC), a digital signal processor (DSP), or any combination thereof.Processor 804 may include one more levels of caching, such as a levelone cache 810 and a level two cache 812, a processor core 814, andregisters 816. An example processor core 814 may include an arithmeticlogic unit (ALU), a floating point unit (FPU), a digital signalprocessing core (DSP Core), or any combination thereof. An examplememory controller 818 may also be used with processor 804, or in someimplementations memory controller 818 may be an internal part ofprocessor 804.

Depending on the desired configuration, system memory 806 may be of anytype including but not limited to volatile memory (such as RAM),non-volatile memory (such as ROM, flash memory, etc.) or any combinationthereof. System memory 806 may include an operating system 820, one ormore applications 822, and program data 824. Application 822 may includea pseudo message algorithm 826 that is arranged to perform the functionsas described herein including those described with respect to theprocess 200, 600, and/or 700 of FIGS. 2, 6, and/or 7. Program data 824may include Ontology data 828 such as a “self” Ontology or an “other”Ontology, or the like that may be useful for configuring the pseudomessage algorithm 826 as is described herein. In some embodiments,application 822 may be arranged to operate with program data 824 onoperating system 820 such that Ontology-based pseudo message generationand/or pseudo message recognition based on Ontology reasoning may beprovided as described herein. This described basic configuration 802 isillustrated in FIG. 8 by those components within the inner dashed line.

Computing device 800 may have additional features or functionality, andadditional interfaces to facilitate communications between basicconfiguration 802 and any required devices and interfaces. For example,a bus/interface controller 830 may be used to facilitate communicationsbetween basic configuration 802 and one or more data storage devices 832via a storage interface bus 834. Data storage devices 832 may beremovable storage devices 836, non-removable storage devices 838, or acombination thereof. Examples of removable storage and non-removablestorage devices include magnetic disk devices such as flexible diskdrives and hard-disk drives (HDD), optical disk drives such as compactdisk (CD) drives or digital versatile disk (DVD) drives, solid statedrives (SSD), and tape drives to name a few. Example computer storagemedia may include volatile and nonvolatile, removable and non-removablemedia implemented in any method or technology for storage ofinformation, such as computer readable instructions, data structures,program modules, or other data.

System memory 806, removable storage devices 836 and non-removablestorage devices 838 are examples of computer storage media. Computerstorage media includes, but is not limited to, RAM, ROM, EEPROM, flashmemory or other memory technology, CD-ROM, digital versatile disks (DVD)or other optical storage, magnetic cassettes, magnetic tape, magneticdisk storage or other magnetic storage devices, or any other mediumwhich may be used to store the desired information and which may beaccessed by computing device 800. Any such computer storage media may bepart of computing device 800.

Computing device 800 may also include an interface bus 840 forfacilitating communication from various interface devices (e.g., outputdevices 842, peripheral interfaces 844, and communication devices 846)to basic configuration 802 via bus/interface controller 830. Exampleoutput devices 842 include a graphics processing unit 848 and an audioprocessing unit 850, which may be configured to communicate to variousexternal devices such as a display or speakers via one or more A/V ports852. Example peripheral interfaces 844 include a serial interfacecontroller 854 or a parallel interface controller 856, which may beconfigured to communicate with external devices such as input devices(e.g., keyboard, mouse, pen, voice input device, touch input device,etc.) or other peripheral devices (e.g., printer, scanner, etc.) via oneor more I/O ports 858. An example communication device 846 includes anetwork controller 860, which may be arranged to facilitatecommunications with one or more other computing devices 862 over anetwork communication link via one or more communication ports 864.

The network communication link may be one example of a communicationmedia. Communication media may typically be embodied by computerreadable instructions, data structures, program modules, or other datain a modulated data signal, such as a carrier wave or other transportmechanism, and may include any information delivery media. A “modulateddata signal” may be a signal that has one or more of its characteristicsset or changed in such a manner as to encode information in the signal.By way of example, and not limitation, communication media may includewired media such as a wired network or direct-wired connection, andwireless media such as acoustic, radio frequency (RF), microwave,infrared (IR) and other wireless media. The term computer readable mediaas used herein may include both storage media and communication media.

Computing device 800 may be implemented as a portion of a small-formfactor portable (or mobile) electronic device such as a cell phone, apersonal data assistant (PDA), a personal media player device, awireless web-watch device, a personal headset device, an applicationspecific device, or a hybrid device that include any of the abovefunctions. Computing device 800 may also be implemented as a personalcomputer including both laptop computer and non-laptop computerconfigurations.

The present disclosure is not to be limited in terms of the particularembodiments described herein, which are intended as illustrations ofvarious aspects. Many modifications and variations can be made withoutdeparting from its spirit and scope, as will be apparent to thoseskilled in the art. Functionally equivalent methods and apparatuseswithin the scope of the disclosure, in addition to those enumeratedherein, will be apparent to those skilled in the art from the foregoingdescriptions. Such modifications and variations are intended to fallwithin the scope of the appended claims. The present disclosure is to belimited only by the terms of the appended claims, along with the fullscope of equivalents to which such claims are entitled. It is to beunderstood that the present disclosure is not limited to particularmethods, reagents, compounds compositions or biological systems, whichcan, of course, vary. It is also to be understood that the terminologyused herein is for the purpose of describing particular embodimentsonly, and is not intended to be limiting.

With respect to the use of substantially any plural and/or singularterms herein, those having skill in the art can translate from theplural to the singular and/or from the singular to the plural as isappropriate to the context and/or application. The varioussingular/plural permutations may be expressly set forth herein for sakeof clarity.

It will be understood by those within the art that, in general, termsused herein, and especially in the appended claims (e.g., bodies of theappended claims) are generally intended as “open” terms (e.g., the term“including” should be interpreted as “including but not limited to,” theterm “having” should be interpreted as “having at least,” the term“includes” should be interpreted as “includes but is not limited to,”etc.). It will be further understood by those within the art that if aspecific number of an introduced claim recitation is intended, such anintent will be explicitly recited in the claim, and in the absence ofsuch recitation no such intent is present. For example, as an aid tounderstanding, the following appended claims may contain usage of theintroductory phrases at least one and one or more to introduce claimrecitations. However, the use of such phrases should not be construed toimply that the introduction of a claim recitation by the indefinitearticles “a” or “an” limits any particular claim containing suchintroduced claim recitation to embodiments containing only one suchrecitation, even when the same claim includes the introductory phrasesone or more or at least one and indefinite articles such as “a” or “an”(e.g., “a” and/or “an” should be interpreted to mean “at least one” or“one or more”); the same holds true for the use of definite articlesused to introduce claim recitations. In addition, even if a specificnumber of an introduced claim recitation is explicitly recited, thoseskilled in the art will recognize that such recitation should beinterpreted to mean at least the recited number (e.g., the barerecitation of “two recitations,” without other modifiers, means at leasttwo recitations, or two or more recitations). Furthermore, in thoseinstances where a convention analogous to “at least one of A, B, and C,etc.” is used, in general such a construction is intended in the senseone having skill in the art would understand the convention (e.g., “asystem having at least one of A, B, and C” would include but not belimited to systems that have A alone, B alone, C alone, A and Btogether, A and C together, B and C together, and/or A, B, and Ctogether, etc.). In those instances where a convention analogous to “atleast one of A, B, or C, etc.” is used, in general such a constructionis intended in the sense one having skill in the art would understandthe convention (e.g., “a system having at least one of A, B, or C” wouldinclude but not be limited to systems that have A alone, B alone, Calone, A and B together, A and C together, B and C together, and/or A,B, and C together, etc.). It will be further understood by those withinthe art that virtually any disjunctive word and/or phrase presenting twoor more alternative terms, whether in the description, claims, ordrawings, should be understood to contemplate the possibilities ofincluding one of the terms, either of the terms, or both terms. Forexample, the phrase “A or B” will be understood to include thepossibilities of “A” or “B” or “A and B.”

In addition, where features or aspects of the disclosure are describedin terms of Markush groups, those skilled in the art will recognize thatthe disclosure is also thereby described in terms of any individualmember or subgroup of members of the Markush group.

As will be understood by one skilled in the art, for any and allpurposes, such as in terms of providing a written description, allranges disclosed herein also encompass any and all possible sub rangesand combinations of sub ranges thereof. Any listed range can be easilyrecognized as sufficiently describing and enabling the same range beingbroken down into at least equal halves, thirds, quarters, fifths,tenths, etc. As a non-limiting example, each range discussed herein canbe readily broken down into a lower third, middle third and upper third,etc. As will also be understood by one skilled in the art all languagesuch as “up to,” “at least,” and the like include the number recited andrefer to ranges which can be subsequently broken down into sub ranges asdiscussed above. Finally, as will be understood by one skilled in theart, a range includes each individual member. Thus, for example, a grouphaving 1-3 cells refers to groups having 1, 2, or 3 cells. Similarly, agroup having 1-5 cells refers to groups having 1, 2, 3, 4, or 5 cells,and so forth.

From the foregoing, it will be appreciated that various embodiments ofthe present disclosure have been described herein for purposes ofillustration, and that various modifications may be made withoutdeparting from the scope and spirit of the present disclosure.Accordingly, the various embodiments disclosed herein are not intendedto be limiting, with the true scope and spirit being indicated by thefollowing claims.

What is claimed is:
 1. A method to recognize pseudo content, comprising:receiving, by a first computing device having an ontology associatedtherewith, one or more messages sent from a second computing device,wherein the ontology includes one or more rules, and wherein the one ormore messages include a first content that is inconsistent with at leastone of the one or more rules of the ontology; analyzing, by the firstcomputing device, at least a portion of the one or more messages;determining, by the first computing device based on the analysis of theat least the portion of the one or more messages, that the first contentis inconsistent with the at least one rule of the ontology; andrecognizing, by the first computing device based on the determination,that the first content is a pseudo content.
 2. The method of claim 1,further comprising: generating, by the first computing device, at leasta portion of the ontology.
 3. The method of claim 1, wherein at least aportion of the ontology is generated by the second computing device. 4.The method of claim 1, wherein at least a portion of the ontology isgenerated by a third device.
 5. The method of claim 1, wherein theanalyzing, by the first computing device, the at least the portion ofthe one or more messages includes: comparing, by the first computingdevice, a content of the one or more messages with one or more of theone or more rules of the ontology.
 6. The method of claim 1, furthercomprising: discarding, by the first computing device, the recognizedpseudo content.
 7. The method of claim 1, further comprising:identifying, by the first computing device, a priority based on thepseudo content.
 8. The method of claim 1, further comprising:authenticating, by the first computing device, the second computingdevice based on the pseudo content.
 9. A method to generate pseudocontent, comprising: accessing, by a transmitting computing device, atleast a portion of an ontology associated with a receiving computingdevice, wherein the ontology includes one or more rules; selecting, bythe transmitting computing device, at least one of the one or more rulesof the ontology; generating, by the transmitting computing device, afirst content that is inconsistent with the selected at least one ruleof the ontology; and sending, by the transmitting computing device, oneor more messages to the receiving computing device, wherein the one ormore messages include the first content.
 10. The method of claim 9,wherein the selecting is based on a security level of the at least oneof the one or more rules of the ontology.
 11. The method of claim 9,further comprising: generating, by the transmitting computing device,the at least a portion of the ontology associated with the receivingcomputing device.
 12. The method of claim 9, further comprising:inserting, into a second content of the one or more messages by thetransmitting device prior to the sending, the first content that isinconsistent with the selected at least one rule of the ontology. 13.The method of claim 9, further comprising: mixing, with other content ofthe one or more messages by the transmitting computing device prior tothe sending, the first content that is inconsistent with the selected atleast one rule of the ontology.
 14. The method of claim 9, wherein thegenerating, by the transmitting computing device, of the first contentthat is inconsistent with the selected at least one rule of the ontologyincludes: expressing the selected at least one rule of the ontology as acorrect sentence; and replacing, by the transmitting computing device,at least one word in the correct sentence with a word to form an errorsentence that is inconsistent with the selected at least one rule of theontology.
 15. A system to recognize pseudo content, comprising: aprocessor; and a non-transitory computer-readable medium havingcomputer-executable instructions stored thereon that are executable bythe processor to perform operations comprising: receiving one or moremessages intended for a receiving computing device having an associatedontology, wherein the ontology includes one or more rules, and whereinthe one or more messages include a first content that corresponds to asecurity class and that is inconsistent with at least one of the one ormore rules of the ontology; analyzing at least a portion of the one ormore messages; determining, based on the analysis of the at least theportion of the one or more messages, that the first content isinconsistent with the at least one rule of the ontology; recognizing,based on the determination, that the first content is a pseudo content;and identifying the security class based on the analyzed first content.16. The system of claim 15, wherein the non-transitory computer-readablemedium has computer-executable instructions stored thereon that areexecutable by the processor to perform operations further comprising:generating at least a portion of the ontology.
 17. The system of claim15, wherein the ontology is implemented as a data structure stored inthe non-transitory computer-readable medium.
 18. The system of claim 15,wherein the analyzing includes: comparing a content of the one or moremessages with the at least one rule of the ontology.
 19. The system ofclaim 15, wherein the non-transitory computer-readable medium hascomputer-executable instructions stored thereon that are executable bythe processor to perform operations further comprising: discarding therecognized pseudo content.
 20. The system of claim 15, wherein thenon-transitory computer-readable medium has computer-executableinstructions stored thereon that are executable by the processor toperform operations further comprising: identifying a priority based onthe pseudo content.